Reversible DNA codes over a family of non-chain rings
نویسندگان
چکیده
In this work we extend results introduced in [15]. Especially, we solve the reversibility problem for DNA codes over the non chain ring Rk,s = F42k [u1, . . . , us]/〈u 2 1 − u1, . . . , u 2 s − us〉. We define an automorphism θ over Rk,s which helps us both finding the idempotent decomposition of Rk,s and solving the reversibility problem via skew cyclic codes. Moreover, we introduce a generalized Gray map that preserves DNA reversibility.
منابع مشابه
On DNA codes from a family of chain rings∗
In this work, we focus on reversible cyclic codes which correspond to reversible DNA codes or reversible-complement DNA codes over a family of finite chain rings, in an effort to extend what was done by Yildiz and Siap in [20]. The ring family that we have considered are of size 2 k , k = 1, 2, · · · and we match each ring element with a DNA 2k−1-mer. We use the so-called u-adic digit system to...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملOn zero divisor graph of unique product monoid rings over Noetherian reversible ring
Let $R$ be an associative ring with identity and $Z^*(R)$ be its set of non-zero zero divisors. The zero-divisor graph of $R$, denoted by $Gamma(R)$, is the graph whose vertices are the non-zero zero-divisors of $R$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$. In this paper, we bring some results about undirected zero-divisor graph of a monoid ring o...
متن کاملAdditive cyclic codes over finite commutative chain rings
Additive cyclic codes over Galois rings were investigated in [3]. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative chain rings, we observe two different kinds of additivity. One of them is a natural generalization of the study in [3], whereas the other one has some unusual propertie...
متن کاملReversible Codes and Applications to DNA
The importance of DNA for living creatures is a very well known fact. Furthermore, the rich structure and knowing the role of the structure of DNA has led the researchers to the direction where the structure of DNA can be realized in computing processes and computer related technologies. Recent studies show that DNA can storage data as a big digital memory and can be a good tool for error corre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.02385 شماره
صفحات -
تاریخ انتشار 2017